void ShellSort(int* arr, int n)
{
	int gap = n;
	while (gap > 1)
	{
		gap = gap / 3 + 1;
		for (int i = 0; i <= n-1; i++)
		{
			int end = i;
			for (int j = i - gap; j >= 0;j -= gap)
			{
				if (arr[end] >= arr[j])
				{
					break;
				}else if (arr[end] < arr[j])
				{
					int tmp = arr[j];
					arr[j] = arr[end];
					arr[end] = tmp;
					end -= gap;
				}
			}
		}
	}
}
int main()
{



	return 0;
}